Maximum common property: a new approach for molecular similarity
نویسندگان
چکیده
منابع مشابه
a new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولA Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation
The advent of data science has spurred interest in estimating properties of distributions over large alphabets. Fundamental symmetric properties such as support size, support coverage, entropy, and proximity to uniformity, received most attention, with each property estimated using a different technique and often intricate analysis tools. We prove that for all these properties, a single, simple...
متن کاملA maximum entropy approach for property prediction of random microstructures
The task of reconstruction of microstructures from their limited description is posed as a maximum entropy (MaxEnt) problem. Microstructural descriptors are taken in the form of volume fractions, correlation functions and grain sizes. Morphological and size quantifications are used as features of microstructure and samples consistent with these features are reconstructed. The nonuniqueness of t...
متن کاملLongest Common Subsequence Based Algorithm for Measuring Similarity Between Time Series: A New Approach
Due to the technological advances particularly in amount of data, new techniques for classification, sensors, mobile computing and GPS, the volume of data indexing, segmentation, prediction, clustering and is increasing at an unpredictable manner in many anomaly detection were proposed [4]. commercial organizations. Nowadays, electronic devices In time series data analysis, similarity computati...
متن کاملA New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectively, and find the largest induced subgraph contained in both of them. MCS is frequently solved by reduction to the problem of finding a maximum clique in the order mn association graph, which is a particular form of pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cheminformatics
سال: 2020
ISSN: 1758-2946
DOI: 10.1186/s13321-020-00462-3